#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1e5 + 10;
int num[N];
int n;

inline void solution() {
    unordered_map<int, int> hash;
    cin >> n;
    for (int i = 0; i < n; i ++ ) {
        cin >> num[i];
        hash[num[i]] = i;
    }
    int res = 0;
    for (int i = 0; i < n; i ++ ) {
        while (num[0] != 0) {
            swap(num[hash[0]], num[hash[hash[0]]]);
            int t = hash[hash[0]];
            hash[hash[0]] = hash[0];
            hash[0] = t;
            res ++ ;
        }
        for (;i < n; i ++ ) {
            if (num[i] != i) break;
        }
        if (i < n) {
            hash[0] = i;
            hash[num[i]] = 0;
            res ++;
            swap(num[0], num[i]);
        }
    }
    cout << res << endl;
    return ;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}